On self-complementary supergraphs of (n, n)-graphs
نویسندگان
چکیده
We prove that, with one exception, each (n, n)-graph G that is embeddable in its complement has a self-complementary supergraph of order n. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملOn finite graphs that are self-complementary and vertex transitive
Self-complementary graphs have been extensively investigated and effectively used in the study of Ramsey numbers. It is well-known and easily proved that there exist regular self-complementary graphs of order n if and only if n == 1 (mod 4). So it is natural to ask whether a similar result for self-complementary vertex-transitive graphs exists. More precisely, for which positive integers n do t...
متن کاملHomogeneously almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost selfcomplementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n − nK2. We con...
متن کاملSelf-Dual Graphs
The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We will give an overview of the recent research in the first two chapters. In the third chapter, we will show the necessary condition that a self-complementary self-dual graph have n ≡ 0,...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 292 شماره
صفحات -
تاریخ انتشار 2000